Peer-Induced Fairness in Games
نویسندگان
چکیده
People exhibit peer-induced fairness concerns when they look to their peers as a reference to evaluate their endowments. We analyze two independent ultimatum games played sequentially by a leader and two followers. With peer-induced fairness, the second follower is averse to receiving less than the first follower. Using laboratory experimental data, we estimate that peer-induced fairness between followers is 2 times stronger than distributional fairness between leader and follower. Allowing for heterogeneity, we find that 50 percent of subjects are fairness-minded. We discuss how peer-induced fairness might limit price discrimination, account for low variability in CEO compensation, and explain pattern bargaining. (JEL: A12, A13, C72, D63.)
منابع مشابه
Cooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملEvent Ordering and Congestion Control for Distributed Multiplayer Games
Peer-to-peer, multiplayer games require secure event ordering, bounded latency between any two players, and a real-time transport protocol that includes congestion control. In the past, research has focused on solving one of these three issues, but has yet to address all of them in conjunction. In this paper, we design the NEO protocol to provide all three of these features in a fully-distribut...
متن کاملGuaranteeing Performance through Fairness in Peer-to-Peer File-Sharing and Streaming Systems
Guaranteeing Performance through Fairness in Peer-to-Peer File-Sharing and Streaming Systems
متن کاملAn Efficient and Fair Solution for Communication Graph Games
We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when applying the solution to t...
متن کاملLocal Fairness in Hedonic Games via Individual Threshold Coalitions
Hedonic games are coalition formation games where players only specify preferences over coalitions they are part of. We introduce and systematically study local fairness notions in hedonic games by suitably adapting fairness notions from fair division. In particular, we introduce three notions that assign to each player a threshold coalition that only depends on the player’s individual preferen...
متن کامل